Computational Statistical Methods for Social Network Models.
نویسندگان
چکیده
We review the broad range of recent statistical work in social network models, with emphasis on computational aspects of these methods. Particular focus is applied to exponential-family random graph models (ERGM) and latent variable models for data on complete networks observed at a single time point, though we also briefly review many methods for incompletely observed networks and networks observed at multiple time points. Although we mention far more modeling techniques than we can possibly cover in depth, we provide numerous citations to current literature. We illustrate several of the methods on a small, well-known network dataset, Sampson's monks, providing code where possible so that these analyses may be duplicated.
منابع مشابه
Computational Concerns in Statistical Inference and Learning for Network Data Analysis
Abstract Network data analysis has wide applications in computational social science, computational biology, online social media, and data visualization. For many of these network inference problems, the brute-force (yet statistically optimal) methods involve combinatorial optimization, which is computationally prohibitive when we are faced with large scale networks. Therefore, it is important ...
متن کاملAppraisal of the evolutionary-based methodologies in generation of artificial earthquake time histories
Through the last three decades different seismological and engineering approaches for the generation of artificial earthquakes have been proposed. Selection of an appropriate method for the generation of applicable artificial earthquake accelerograms (AEAs) has been a challenging subject in the time history analysis of the structures in the case of the absence of sufficient recorded accelerogra...
متن کاملAuxiliary Parameter MCMC for Exponential Random Graph Models
Exponential random graph models (ERGMs) are a well-established family of statistical models for analyzing social networks. Computational complexity has so far limited the appeal of ERGMs for the analysis of large social networks. Efficient computational methods are highly desirable in order to extend the empirical scope of ERGMs. In this paper we report results of a research project on the deve...
متن کاملComputational Methods for Learning and Inference on Dynamic Networks
Networks are ubiquitous in science, serving as a natural representation for many complex physical, biological, and social phenomena. Significant efforts have been dedicated to analyzing such network representations to reveal their structure and provide some insight towards the phenomena of interest. Computational methods for analyzing networks have typically been designed for static networks, w...
متن کاملComplexity Theory and Models for Social Networks
Much work in complexity theory employs agent-based models in simulations of systems of multiple agents. Agent interaction follows some standard types of network topologies. My aim is to assess how recent advances in the statistical modeling of social networks may contribute to agent-based modeling traditions, specifically, by providing structural characterizations of a variety of network topolo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America
دوره 21 4 شماره
صفحات -
تاریخ انتشار 2012